K-Nearest Neighbors Method for Recommendation System in Bangkalan’s Tourism

نویسندگان

چکیده

The more tourist objects are in an area, the challenging it is for local governments to increase selling value of these attractions. government always strives develop attraction areas by prioritizing beauty However, visitors often have difficulty determining that match their criteria because many choices. research developed a recommendation system applying machine learning techniques. technique used was K-Nearest Neighbor (KNN) method. Several trials were conducted with dataset 315 records, consisting 11 attributes and 21 Based on dataset, preprocessing stage previously carried out improve data format selecting where separated based existing criteria, then calculating closest distance k KNN results divided into five folds each classification highest accuracy obtained at 78% k=1. It shows method can provide recommendations three classes Bangkalan. Applying determines several alternative tourists visit according natural, cultural, religious objects.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

K - Nearest Neighborhood based Music Recommendation System

A. Introduction Recommendation systems are an active topic in research and industry. The technique of collaborative filtering is especially successful in generating personalized recommendations. More than a decade of research has resulted in numerous algorithms, out of which, we have chosen K-Nearest Neighborhood (K-NN) model to predict the ratings for the songs. This model is an item-based alg...

متن کامل

Approximate K Nearest Neighbors in High Dimensions

Given a set P of N points in a ddimensional space, along with a query point q, it is often desirable to find k points of P that are with high probability close to q. This is the Approximate k-NearestNeighbors problem. We present two algorithms for AkNN. Both require O(Nd) preprocessing time. The first algorithm has a query time cost that is O(d+logN), while the second has a query time cost that...

متن کامل

k-Nearest Neighbors in Uncertain Graphs

Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of similarity search in standard graphs, a fundamental problem for probabilistic graphs is to efficiently answer k-nearest neighbor queries (k-NN), which is the problem of computing the k closest nodes to some specific node....

متن کامل

Search K Nearest Neighbors on Air

While the K-Nearest-Neighbor (KNN) problem is well studied in the traditional wired, disk-based client-server environment, it has not been tackled in a wireless broadcast environment. In this paper, the problem of organizing location dependent data and answering KNN queries on air are investigated. The linear property of wireless broadcast media and power conserving requirement of mobile device...

متن کامل

k*-Nearest Neighbors: From Global to Local

The weighted k-nearest neighbors algorithm is one of the most fundamental nonparametric methods in pattern recognition and machine learning. The question of setting the optimal number of neighbors as well as the optimal weights has received much attention throughout the years, nevertheless this problem seems to have remained unsettled. In this paper we offer a simple approach to locally weighte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ComTech

سال: 2023

ISSN: ['2476-907X', '2087-1244']

DOI: https://doi.org/10.21512/comtech.v14i1.7993